Pointwise Debreu Lexicographic Powers
نویسندگان
چکیده
A linear ordering (X,≺) is a Debreu chain (or has the Debreu property) if each subordering (Y,≺) of X can be embedded into X with an injective function that is both order-preserving and continuous with respect to the order topology on X and Y . The most typical example of a Debreu chain is the linearly ordered topological space (R, <, τ<) of real numbers endowed with its usual order < and the order topology τ< . The Debreu property is of fundamental importance when dealing with utility representations. Recall that a utility representation for a chain (X,≺) is a pair (U, f), where (U,<) is a chain and f : X → U is an order-preserving embedding, i.e., for each x, y ∈ X, if x ≺ y then f(x) < f(y); the linear ordering U is called the base chain of the representation, and the map f a utility function. Traditionally, the literature has been dealing with utility representations such that the base chain (Y, <) is the set R of real numbers, endowed with its natural order <. Specifically, much attention has been devoted to the the following topics: (A) the existence of an R-valued utility function; (B) the continuity of such a function. With this respect, our goals are: (A) to justify alternative types of utility representations, in particular lexicographic products of linear orderings; (B) to suggest suitable continuity properties that a utility representation should satisfy, in particular some Debreu-like properties. The topic of our research is a combination of (A) and (B), i.e., a study of a Debreu-like property of lexicographic powers. In the sequel, we briefly outline the state of the art of (A) and (B), in order to put our study into a proper perspective.
منابع مشابه
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs
Consider two graphs G and H. Let H[G] be the lexicographic product of H and G, where H is the lexicographic product of the graph H by itself k times. In this paper, we determine the spectrum of H[G] and H whenG andH are regular and the Laplacian spectrum ofH[G] andH for G and H arbitrary. Particular emphasis is given to the least eigenvalue of the adjacency matrix in the case of lexicographic p...
متن کاملIsomorphisms of Lexicographic Powers of the Reals
Given a chain we consider the lexicographic order R If is a chain such that R R we examine the question whether necessarily Under an additional hypothesis we show that and will have the same order types of well ordered subsets Among others this yields an a rmative answer to the above question in the case where and are ordinals
متن کاملThe Powers Sum of spatial CPD-semigroups and CP-semigroups
We define spatial CPD-semigroup and construct their Powers sum. We construct the Powers sum for general spatial CP-semigroups. In both cases, we show that the product system of that Powers sum is the product of the spatial product systems of its factors. We show that on the domain of intersection, pointwise bounded CPD-semigroups on the one side and Schur CP-semigroups on the other, the constru...
متن کاملLexicographic exponentiation of chains
The lexicographic power ∆Γ of chains ∆ and Γ is, roughly, the Cartesian power ∏ γ∈Γ∆, totally ordered lexicographically from the left. Here the focus is on certain powers in which either ∆ = R or Γ = R, with emphasis on when two such powers are isomorphic and on when ∆Γ is 2-homogeneous. The main results are: 1) For a countably infinite ordinal α, Rα+α ' R. 2) RR 6' RQ. 3) For ∆ a countable ord...
متن کاملThe edge-isoperimetric problem for discrete tori
The edge-isoperimetric problem has long been solved for cartesian powers of the cycles C3 and C4, for which the lexicographic order is the optimal order, and powers of the cycles Cn with n¿ 5, which do not have nested optimal subsets. For powers of C5, it is clear that the lexicographic order is not optimal. We present a solution to the edge-isoperimetric problem for powers of C5 in the form of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Order
دوره 26 شماره
صفحات -
تاریخ انتشار 2009